Possible Patterns

“There are no gaps in logical space,” David Lewis writes, giving voice to sentiment shared by many philosophers. But different natural ways of trying to make this sentiment precise turn out to conflict with one another. One is a *pattern* idea: “Any pattern of instantiation is metaphysically possible.” Another is a *cut and paste* idea: “For any objects in any worlds, there exists a world that contains any number of duplicates of all of those objects.” We use resources from model theory to show the inconsistency of certain packages of combinatorial principles and the consistency of others

Bayesianism, Infinite Decisions, and Binding

We pose and resolve several vexing decision theoretic puzzles. Some are variants of existing puzzles, such as ‘Trumped’ (Arntzenius and McCarthy 1997), ‘Rouble trouble’ (Arntzenius and Barrett 1999), ‘The airtight Dutch book’ (McGee 1999), and ‘The two envelopes puzzle’ (Broome 1995). Others are new. A unified resolution of the puzzles shows that Dutch book arguments have no force in infinite cases. It thereby provides evidence that reasonable utility functions may be unbounded and that reasonable credence functions need not be countably additive. The resolution also shows that when infinitely many decisions are involved, the difference between making the decisions simultaneously and making them sequentially can be the difference between riches and ruin. Finally, the resolution reveals a new way in which the ability to make binding commitments can save perfectly rational agents from sure losses

Solving a Paradox of Evidential Equivalence

David Builes presents a paradox concerning how confident you should be that any given member of an infinite collection of fair coins landed heads, conditional on the information that they were all flipped and only finitely many of them landed heads. We argue that if you should have any conditional credence at all, it should be 1/2

Operator arguments revisited

Certain passages in Kaplan’s ‘Demonstratives’ are often taken to show that non-vacuous sentential operators associated with a certain parameter of sentential truth require a corresponding relativism concerning assertoric contents: namely, their truth values also must vary with that parameter. Thus, for example, the non-vacuity of a temporal sentential operator ‘always’ would require some of its operands to have contents that have different truth values at different times. While making no claims about Kaplan’s intentions, we provide several reconstructions of how such an argument might go, focusing on the case of time and temporal operators as an illustration. What we regard as the most plausible reconstruction of the argument establishes a conclusion similar enough to that attributed to Kaplan. However, the argument overgenerates, leading to absurd consequences. We conclude that we must distinguish assertoric contents from compositional semantic values, and argue that once they are distinguished, the argument fails to establish any substantial conclusions. We also briefly discuss a related argument commonly attributed to Lewis, and a recent variant due to Weber

Religious Knowledge

This paper will examine two strategies by which religious believers might attempt to defend the rationality of religious belief. The first strategy is a “fine tuning argument.” The main shortcoming of that strategy is that it ignores the crucial issue of the appropriate prior probabilities. The second strategy is what might be called a “trust” strategy. According to this strategy, a belief that is based on trusting someone who knows something is thereby also an instance of knowledge. This strategy might suffice in some respects, but it involves reliance on a mechanism that is doubtful as a prototype for all of our beliefs

A simulation study of a proposed computer installation

The operation of a data processing center has been studied with the objective of investigating the effect of various facilities, job loads, and operating policies as measured by job turnaround time. The mechanism for study was digital computer simulation. This thesis purports to review the technology of simulation and the associated computer techniques, defines the problem and the alternatives available, and analyzes the results derived from the experiments. Conclusions drawn from this study support the current practice of a functioning data processing center --Abstract, page ii

Response

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/108591/1/mila12063.pd

Scepticism

To what extent are the answers to theological questions knowable? And if the relevant answers are knowable, which sorts of inquirers are in a position to know them? In this chapter we shall not answer these questions directly but instead supply a range of tools that may help us make progress here. The tools consist of plausible structural constraints on knowledge. After articulating them, we shall go on to indicate some ways in which they interact with theological scepticism. In some cases the structural constraints bear directly on whether one can know answers to theological questions. But the structural considerations are related to theological scepticism in other interesting ways as well; for instance we will also be using them to explore the significance of scepticism, by addressing questions such as ‘To what extent does it matter whether or not we can know the answer to theological questions?

Desire

In this paper, we present two puzzles involving desire reports concerning series of events. What does a person want to happen in the first event – is it the event with the highest expected return, or the event that is the initial part of the best series? We show that existing approaches fail to resolve the puzzles around this question and develop a novel account of our own. Our semantics is built around three ideas. First, we propose that desire ascriptions are evaluated relative to a contextually supplied set of propositions, or alternatives. The semantic value of an ascription ‘S wants p’ is determined by S's preference ordering over these alternatives. Second, we propose that desire reports carry a requirement to the effect that the prejacent of the ascription must be suitably related to the background set of alternatives. Finally, we suggest that desire reports carry a dominance condition concerning the subject's ranking of the alternatives. Overall, we argue that our theory provides us with an elegant resolution of our puzzles, and yields a promising approach to desire